Signed Domination in Regular Graphs and Set-Systems
نویسندگان
چکیده
منابع مشابه
Signed Domination in Regular Graphs and Set-Systems
Suppose G is a graph on n vertices with minimum degree r. Using standard random methods it is shown that there exists a two-coloring of the vertices of G with colors, +1 and −1, such that all closed neighborhoods contain more 1’s than −1’s, and altogether the number of 1’s does not exceed the number of −1’s by more than (4 p log r/r + 1/r)n. For large r this greatly improves earlier results and...
متن کاملWeak signed Roman domination in graphs
A {em weak signed Roman dominating function} (WSRDF) of a graph $G$ with vertex set $V(G)$ is defined as afunction $f:V(G)rightarrow{-1,1,2}$ having the property that $sum_{xin N[v]}f(x)ge 1$ for each $vin V(G)$, where $N[v]$ is theclosed neighborhood of $v$. The weight of a WSRDF is the sum of its function values over all vertices.The weak signed Roman domination number of $G...
متن کاملWeak signed Roman k-domination in graphs
Let $kge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$.A weak signed Roman $k$-dominating function (WSRkDF) on a graph $G$ is a function$f:V(G)rightarrow{-1,1,2}$ satisfying the conditions that $sum_{xin N[v]}f(x)ge k$ for eachvertex $vin V(G)$, where $N[v]$ is the closed neighborhood of $v$. The weight of a WSRkDF $f$ is$w(f)=sum_{vin V(G)}f(v)$. The weak si...
متن کاملSigned total Italian k-domination in graphs
Let k ≥ 1 be an integer, and let G be a finite and simple graph with vertex set V (G). A signed total Italian k-dominating function (STIkDF) on a graph G is a functionf : V (G) → {−1, 1, 2} satisfying the conditions that $sum_{xin N(v)}f(x)ge k$ for each vertex v ∈ V (G), where N(v) is the neighborhood of $v$, and each vertex u with f(u)=-1 is adjacent to a vertex v with f(v)=2 or to two vertic...
متن کاملNonnegative signed total Roman domination in graphs
Let $G$ be a finite and simple graph with vertex set $V(G)$. A nonnegative signed total Roman dominating function (NNSTRDF) on a graph $G$ is a function $f:V(G)rightarrow{-1, 1, 2}$ satisfying the conditionsthat (i) $sum_{xin N(v)}f(x)ge 0$ for each $vin V(G)$, where $N(v)$ is the open neighborhood of $v$, and (ii) every vertex $u$ for which $f(u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1999
ISSN: 0095-8956
DOI: 10.1006/jctb.1999.1905